منابع مشابه
A typed context calculus
This paper develops a typed calculus for contexts i.e., lambda terms with \holes".In addition to ordinary lambda terms, the calculus contains labeled holes, hole ab-straction and context application for manipulating rst-class contexts. The primaryoperation for contexts is holelling, which captures free variables. This operationcon icts with substitution of the lambda calculus, a...
متن کاملA Simply Typed Context Calculus with First-class Environments
We introduce a simply typed λ-calculus λκε which has both contexts and environments as first-class values. In λκε, holes in contexts are represented by ordinary variables of appropriate types and hole filling is represented by the functional application together with a new abstraction mechanism which takes care of packing and unpacking of the term which is used to fill in the holes of the conte...
متن کاملA simply typed context calculus with rst-class environments
We introduce a simply typed -calculus " which has both contexts and environments as rst-class values. In ", holes in contexts are represented by ordinary variables of appropriate types and hole lling is represented by the functional application together with a new abstraction mechanism which takes care of packing and unpacking of the term which is used to ll in the holes of the context. " is a ...
متن کاملA Typed Pattern Calculus
The theory of programming with pattern-matching function deenitions has been studied mainly in the framework of rst-order rewrite systems. We present a typed functional calculus that emphasizes the strong connection between the structure of whole pattern deenitions and their types. In this calculus type-checking guarantees the absence of runtime errors caused by non-exhaustive pattern-matching ...
متن کاملA Typed Interrupt Calculus
Most real-time systems require responsive interrupt handling. Programming of interrupt handlers is challenging: in order to ensure responsiveness, it is often necessary to have interrupt processing enabled in the body of lower priority handlers. It would be a programming error to allow the interrupt handlers to interrupt each other in a cyclic fashion; it could lead to an unbounded stack. Until...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00174-2